q-Series Arising From The Study of Random Graphs
نویسندگان
چکیده
This paper deals with q{series arising from the study of the transitiveclosure problem in random acyclic digraphs. In particularit presents an identity involvingdivisor generatingfunctions which allows to determine the asymptotic behavior of polynomials deened by a general class of recursive equations, including the polynomials for the mean and the variance of the size of the transitive closure in random acyclic digraphs.
منابع مشابه
Super Pair Sum Labeling of Graphs
Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملComparison between Rational Gegenbauer and Modified Generalized Laguerre Functions Collocation Methods for Solving the Case of Heat Transfer Equations Arising in Porous Medium
متن کامل
Spin Glasses on Thin Graphs
In a recent paper [1] we found strong evidence from simulations that the Ising antiferromagnet on “thin” random graphs Feynman diagrams displayed a mean-field spin glass transition. The intrinsic interest of considering such random graphs is that they give mean field theory results without long range interactions or the drawbacks, arising from boundary problems, of the Bethe lattice. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 10 شماره
صفحات -
تاریخ انتشار 1997